Adaptive cross approximation for ill-posed problems
نویسندگان
چکیده
منابع مشابه
Ill-Posed and Linear Inverse Problems
In this paper ill-posed linear inverse problems that arises in many applications is considered. The instability of special kind of these problems and it's relation to the kernel, is described. For finding a stable solution to these problems we need some kind of regularization that is presented. The results have been applied for a singular equation.
متن کاملAdaptivity with Relaxation for Ill-posed Problems and Global Convergence for a Coefficient Inverse Problem
GLOBAL CONVERGENCE FOR A COEFFICIENT INVERSE PROBLEM ∗ LARISA BEILINA† , MICHAEL V. KLIBANOV ‡ , AND MIKHAIL YU. KOKURIN § Abstra t. A new framework of the Fun tional Analysis is developed for the adaptive FEM (adaptivity) for the Tikhonov regularization fun tional for ill-posed problems. As a result, the relaxation property for adaptive mesh re nements is established. An appli ation to a multi...
متن کاملA Compressive Landweber Iteration for Solving Ill-Posed Inverse Problems
In this paper we shall be concerned with the construction of an adaptive Landweber iteration for solving linear ill-posed and inverse problems. Classical Landweber iteration schemes provide in combination with suitable regularization parameter rules order optimal regularization schemes. However, for many applications the implementation of Landweber’s method is numerically very intensive. Theref...
متن کاملMathematical Principles of Data Inversion
Inverse elastic-wave scattering problems are shown to be ill-posed in general. Standard simplifying assumptions--the first Born approximation, the physical optics approximation, and the stopping power approximation of tomography--are shown to reduce to the same ill-posed mathematical problem, that of inverting a Fourier transform. Practical implications of this fact are illustrated with examples.
متن کاملProjected Tikhonov Regularization of Large-Scale Discrete Ill-Posed Problems
The solution of linear discrete ill-posed problems is very sensitive to perturbations in the data. Confidence intervals for solution coordinates provide insight into the sensitivity. This paper presents an efficient method for computing confidence intervals for large-scale linear discrete ill-posed problems. The method is based on approximating the matrix in these problems by a partial singular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Computational Applied Mathematics
دوره 303 شماره
صفحات -
تاریخ انتشار 2016